Method of decoding intra prediction data

ABSTRACT

A video coding device may be configured to perform intra prediction coding according to one or more of the techniques described herein.

TECHNICAL FIELD

This disclosure relates to video coding and more particularly totechniques for intra prediction coding.

BACKGROUND ART

Digital video capabilities can be incorporated into a wide range ofdevices, including digital televisions, laptop or desktop computers,tablet computers, digital recording devices, digital media players,video gaining devices, cellular telephones, including so-called “smart”phones, medical imaging devices, and the like. Digital video may becoded according to a video coding standard. Video coding standards mayincorporate video compression techniques. Examples of video codingstandards include ISO/IEC MPEG-4 Visual and ITU-T H.264 (also known asISO/IEC MPEG-4 AVC) and High-Efficiency Video Coding (HEVC). HEVC isdescribed in High Efficiency Video Coding (HEVC), Rec. ITU-T H.265October 2014, which is incorporated by reference and referred to hereinas ITU-T H.265. Extensions and improvements for ITU-T H.265 arecurrently being considered for development of next generation videocoding standards. For example, the ITU-T Video Coding Experts Group(VCEG) and ISO/IEC (Moving Picture Experts Group (MPEG) (collectivelyreferred to as the Joint Video Exploration Team (JVET)) are studying thepotential need for standardization of future video coding technologywith a compression capability that significantly exceeds that of thecurrent HEVC standard. The Joint Exploration Model 1 (JEM 1), AlgorithmDescription of Joint Exploration Test Model 1 (JEM 1), ISO/IECJTC1/SC29/WG11/N15790, October 2015, Geneva, CH, which is incorporatedby reference herein, describes the coding features that are undercoordinated test model study by the JVET as potential enhanced videocoding technology beyond the capabilities of ITU-T H.265. It should benoted that the coding features of JEM 1 are implemented in JEM referencesoftware maintained by the Fraunhofer research organization. Currently,Revision 102 of the JEM reference software is available. As used herein,the term JEM is used to collectively refer to algorithm descriptions ofJEM 1 and implementations of JEM reference software.

Video compression techniques enable data requirements for storing andtransmitting video data to be reduced. Video compression techniques mayreduce data requirements by exploiting the inherent redundancies in avideo sequence. Video compression techniques may sub-divide a videosequence into successively smaller portions (i.e., groups of frameswithin a video sequence, a frame within a group of frames, slices withina frame, coding tree units (e.g., macroblocks) within a slice, codingblocks within a coding tree unit, coding units within a coding block,etc.). Intra prediction coding techniques (e.g., intra-picture(spatial)) and inter prediction techniques (i.e., inter-picture(temporal)) may be used to generate difference values between a unit ofvideo data to be coded and a reference unit of video data. Thedifference values may be referred to as residual data. Residual data maybe coded as quantized transform coefficients. Syntax elements may relateresidual data and a reference coding unit (e.g., intra-prediction modeindices, motion vectors, and block vectors). Residual data and syntaxelements may be entropy coded. Entropy encoded residual data and syntaxelements may be included in a compliant bitstream.

SUMMARY OF INVENTION

In general, this disclosure describes various techniques for codingvideo data. In particular, this disclosure describes techniques forintra prediction video coding. It should be noted that althoughtechniques of this disclosure are described with respect to the ITU-TH.264, the ITU-T H.265, and JEM, the techniques of this disclosure aregenerally applicable to video coding. For example, intra predictionvideo coding techniques that are described herein with respect to ITU-TH.265 may be generally applicable to video coding. For example, thecoding techniques described herein may be incorporated into video codingsystems, (including future video coding standards) including blockstructures, intra prediction techniques, inter prediction techniques,transform techniques, filtering techniques, and/or entropy codingtechniques other than those included in ITU-T H.265. Thus, reference toITU-T H.264, ITU-T H.265, and/or JEM is for descriptive purposes andshould not be construed to limit the scope to of the techniquesdescribed herein.

A method of encoding intra prediction data, the method comprising:receiving a selected intra prediction mode; determining whether theselected intra prediction mode corresponds to a most probable modecandidate; and upon determining the selected intra prediction mode doesnot correspond to a most probable mode candidate, determining whetherthe selected intra prediction mode belongs one of two or more sets,wherein the two or more sets include modes other than the most probablemode candidates.

A method of decoding intra prediction data, the method comprising:determining whether a selected intra prediction mode includes a mostprobable mode candidate; upon determining the selected intra predictionmode does not include a most probable mode candidate, determining whichof two or more sets the selected mode belongs, wherein the two or moresets include modes other than the most probable mode candidates; andparsing an index value associated with the set the selected modebelongs, and determining a mode based on the index value.

A method of filtering a block of video data, the method comprising:receiving a reference video block generated using an intra predictionmode; and modifying each sample value included in the reference videoblock based on a sample value corresponding to an upper row, a samplevalue corresponding to a left column, and a multiplier associated with acurrent sample value.

A method of filtering a block of video data, the method comprising:receiving a reference video block generated using an intra predictionmode; determining whether the intra prediction mode is included in a setof prediction modes associated with a first diagonal directionalprediction mode; determining whether the intra prediction mode isincluded in a set of prediction modes associated with a second diagonaldirectional prediction mode; and applying a first filter to thereference video block or a second filter to the reference video blockbased on whether the prediction mode is included in a set of predictionmodes associated with a first diagonal directional prediction mode orincluded in a set of prediction modes associated with a second diagonaldirectional prediction mode.

A method of performing a transform process for an intra prediction videoblock, the method comprising: determining an intra prediction mode;generating a block of transform values associated using the intraprediction mode; receiving an entropy encoded syntax element indicatingone of four conditions associated with the transform process; anddecoding the entropy encoded syntax element based on whether an intraprediction mode associated with the block of transform values is a DC orplanar prediction mode.

A method of signaling a condition associated with a transform processfor an intra prediction video block, the method comprising: signaling anintra prediction mode; and signaling an entropy encoded syntax elementindicating one of four conditions associated with the transform process,wherein the decoding of the entropy encoded syntax element is based onwhether the intra prediction mode is a DC or planar prediction mode.

The details of one or more examples are set forth in the accompanyingdrawings and the description below. Other features, objects, andadvantages will be apparent from the description and drawings, and fromthe claims.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a block diagram illustrating an example of a system that maybe configured to encode and decode video data according to one or moretechniques of this this disclosure.

FIG. 2 is a block diagram illustrating an example of a video encoderthat may be configured to encode video data according to one or moretechniques of this disclosure.

FIG. 3 is a block diagram illustrating an example of an intra predictionprocessing unit that may be configured to encode video data according toone or more techniques of this disclosure.

FIG. 4 is a flowchart illustrating encoding intra prediction dataaccording to one or more techniques of this disclosure.

FIG. 5 is a conceptual diagram illustrating filtering intra predictionvideo blocks according to one or more techniques of this disclosure.

FIG. 6 is a block diagram illustrating an example of an entropy encoderthat may be configured to encode syntax elements according to one ormore techniques of this disclosure.

FIG. 7 is a block diagram illustrating an example of a video decoderthat may be configured to decode video data according to one or moretechniques of this disclosure.

FIG. 8 is a block diagram illustrating an example of an entropy decodingunit that may be configured to decode video data according to one ormore techniques of this disclosure.

FIG. 9 is a block diagram illustrating an example of an intra predictionprocessing unit that may be configured to decode video data according toone or more techniques of this disclosure.

FIG. 10 is a flowchart illustrating decoding intra prediction dataaccording to one or more techniques of this disclosure.

FIG. 11 is a conceptual diagram illustrating a set of possible intraprediction modes according to one or more techniques of this disclosure.

FIG. 12 is a conceptual diagram illustrating examples of generating anintra prediction block and examples of smoothing an intra predictionblock using intra prediction techniques according to one or moretechniques of this disclosure.

DESCRIPTION OF EMBODIMENTS

Video content typically includes video sequences comprised of a seriesof frames. A series of frames may also be referred to as a group ofpictures (GOP). Each video frame or picture may include a plurality ofslices or tiles, where a slice or tile includes a plurality of videoblocks. A video block may be defined as the largest array of pixelvalues (also referred to as samples) that may be predictively coded.Video blocks may be ordered according to a scan pattern (e.g., a rasterscan). A video encoder performs predictive encoding on video blocks andsub-divisions thereof. ITU-T H.264 specifies a macroblock including16×16 luma samples. ITU-T H.265 specifies an analogous Coding Tree Unit(CTU) structure where a picture may be split into CTUs of equal size andeach CTU may include Coding Tree Blocks (CTB) having 16×16, 32×32, or64×64 luma samples. JEM specifies a CTU having a maximum size of 256×256luma samples. As used herein, the term video block may generally referto an area of a picture or may more specifically refer to the largestarray of pixel values that may be predictively coded, sub-divisionsthereof, and/or corresponding structures.

In ITU-T H.265, the CTBs of a CTU may be partitioned into Coding Blocks(CB) according to a corresponding quadtree block structure. In JEM, CTBsmay be further partitioned according to a binary tree structure. Thatis, JEM specifies a quadtree plus binary tree (QTBT) block structure.According to ITU-T H.265, one luma CB together with two correspondingchroma CBs and associated syntax elements are referred to as a codingunit (CU). A CU is associated with a prediction unit (PU) structuredefining one or more prediction units (PU) for the CU, where a PU isassociated with corresponding reference samples. That is, in ITU-T H.265the decision to code a picture area using intra prediction or interprediction is made at the CU level. In ITU-T H.265, a PU may includeluma and chroma prediction blocks (PBs), where square PBs are supportedfor intra prediction and rectangular PBs are supported for interprediction. Intra prediction data (e.g., intra prediction mode syntaxelements) or inter prediction data (e.g., motion data syntax elements)may associate PUs with corresponding reference samples. In JEM, thebinary tree structure enables square and rectangular binary tree leafnodes, which are referred to as Coding Blocks (CBs). In JEM, CBs may beused for prediction without any further partitioning. Further, in JEM,luma and chroma components may have separate QTBT structures. Thedifference between sample values included in a PU, CB, or another typeof picture area structure and associated reference samples may bereferred to as residual data.

Residual data may include respective arrays of difference valuescorresponding to each component of video data (e.g., luma (Y) and chroma(Cb and Cr). Residual data may be in the pixel domain. A transform, suchas, a discrete cosine transform (DCT), a discrete sine transform (DST),an integer transform, a wavelet transform, or a conceptually similartransform, may be applied to pixel difference values to generatetransform coefficients. It should be noted that in ITU-T H.265, PUs maybe further sub-divided into Transform Units (TUs). That is, an array ofpixel difference values may be sub-divided for purposes of generatingtransform coefficients (e.g., four 8×8 transforms may be applied to a16×16 array of residual values), such sub-divisions may be referred toas Transform Blocks (TBs). In JEM, residual values corresponding to a CBmay be used to generate transform coefficients. In JEM, an AdaptiveMultiple Transform (AMT) scheme may be used for generating transformcoefficients. An AMT scheme may include generating transformcoefficients using a transform set, where a transform set includesdefined transform matrices. Transform matrices may correspond to one ofthe eight versions of DCT or one of the eight versions of DST, where theeight versions of DCT and the eight versions of DST form the family ofdiscrete trigonometric transforms. In one example, particular transformsets may correspond to intra prediction modes. Further, in JEM, a coretransform and a subsequent secondary transform may be applied togenerate transform coefficients. Further, whether a subsequent secondarytransform is applied to generate transform coefficients may be dependenton a prediction mode.

Transform coefficients may be quantized according to a quantizationparameter (QP). Quantized transform coefficients may be entropy codedaccording to an entropy encoding technique (e.g., content adaptivevariable length coding (CAVLC), context adaptive binary arithmeticcoding (CABAC), probability interval partitioning entropy coding (PIPE),etc.). Further, syntax elements, such as, a syntax element indicating aprediction mode, may also be entropy coded. Entropy encoded quantizedtransform coefficients and corresponding entropy encoded syntax elementsmay form a compliant bitstream that can be used to reproduce video data.A binarization process may be performed on syntax elements as part of anentropy coding process. Binarization refers to the process of convertinga syntax value into a series of one or more bits. These bits may bereferred to as “bins.”

As described above, intra prediction data or inter prediction data mayassociate an area of a picture (e.g., a PU or a CB) with correspondingreference samples. For intra prediction coding, an intra prediction modemay specify the location of reference samples within a picture. In ITU-TH.265, defined possible intra prediction modes include a planar (i.e.,surface fitting) prediction mode (predMode: 0), a DC (i.e., flat overallaveraging) prediction mode (predMode: 1), and 33 angular predictionmodes (predMode: 2-34). For angular prediction modes, a row ofneighboring samples above a PU or CB, a column of neighboring samples tothe left of a PU or CB, and an upperleft neighboring sample may bedefined. Angular prediction modes enable a reference sample to bederived for each sample included in a PU or CB by pointing to samples inthe row of neighboring samples, the column of neighboring samples,and/or the upperleft neighboring sample. In JEM, defined possibleintra-prediction modes include a planar prediction mode (predMode: 0), aDC prediction mode (predMode: 1), and 65 angular prediction modes(predMode: 2-66). It should be noted that planar and DC prediction modesmay be referred to as non-directional prediction modes and the angularprediction modes may be referred to as directional prediction modes. Itshould be noted that the techniques described herein may be generallyapplicable regardless of the number of defined possible prediction modesand may be particularly useful for efficiently coding a large number(e.g., greater than 35 or greater than 67) of defined possibleprediction modes. For example, possible intra prediction modes mayinclude any number of non-directional prediction modes (e.g., two ormore fitting or averaging modes) and any number of directionalprediction modes (e.g., 35 or more angular prediction modes). It shouldbe noted that, as described in further detail below, the techniquesdescribed herein may be applicable to a set of possible intra predictionmodes having a various densities. Further, it should be noted that thetechniques described herein may be applicable for intra predictiontechniques incorporating neighboring samples (including samples notimmediately adjacent to a PU or CB) other than those defined in ITU-TH.265 and/or JEM. For example, in ITU-T H.265 a row of neighboringsamples typically includes twice as many samples as a row of a PU (e.g.,for a 8×8 PU, a row of neighboring samples includes 16 samples), thetechniques described herein may be applicable in the case where fewer ormore neighboring samples are available to generate a block of referencesamples.

In ITU-T H.265, for a current prediction block, one of the 35 possibleintra prediction modes may be derived by inferring an intra predictionmode from a neighboring intra predicted prediction unit. In ITU-T H.265,an intra prediction mode may be inferred from a neighboring intrapredicted prediction unit by deriving a list of candidate intraprediction modes based on neighboring intra predicted prediction unitsand signaling an index value corresponding to a prediction mode withinthe list of candidate prediction modes. Candidate intra prediction modesmay be referred to as most probable modes (MPMs). In ITU-T H.265, MPMsmay be derived based on the conditions specified in Table 1 below. Itshould be noted that in Table 1, L refers to an available leftneighboring intra predicted prediction unit and A refers to an availableabove neighboring intra predicted prediction unit. Further, in Table 1,the numbering of prediction modes corresponds to those defined in ITU-TH.265. In Table 1, % refers to a modulus operation, where x % y equalsthe remainder of x divided by y.

TABLE 1 ITU-T H.265 Derivation of MPMs Conditions MPM0 MPM1 MPM2 L = A L≠ Planar and L ≠ DC L 2 + ((L + 29) % 32) 2 + ((L − 1) % 32) OtherwisePlanar DC 26 (Vertical) L ≠ A L ≠ Planar L A Planar and R ≠ Planarotherwise L + A < 2 L A 26 (Vertical) otherwise L A DC

One or more syntax elements may identify one of the possible intraprediction modes. As illustrated in Table 1, ITU-T H.265 specifies thatthree MPMs may be derived. In ITU-T H.265, one of the three MPMs may beindicated using a syntax element indicating a MPM index value, i.e.,‘mpm_idx’. Further, in ITU-T H.265, another syntax element may indicatea prediction mode other than a prediction mode included as a MPM, i.e.,‘rem_intra_luma_pred_mode’. That is, in ITU-T H.265, a ‘mpm_idx’ indexvalue indicates one of three of the MPMs and ‘rem_intra_luma_pred_mode’indicates one of the remaining 32 of the defined 35 intra predictionmodes. In ITU-T H.265, a truncated rice (TR) binarization process isspecified for ‘mpm_idx’ and a fixed length (FL) binarization process isdefined for ‘rem_intra_luma_pred_mode’ (i.e., a 5-bit fixed length codemay indicate one of 32 intra prediction modes). Examples of a truncatedrice binarization process and a fixed length binarization process aredescribed in further detail below.

In JEM, in a manner similar to ITU-T H.265, one of the 67 possible intraprediction modes may be derived by inferring an intra prediction modefrom a neighboring intra predicted prediction unit or through signalinga remaining prediction mode. However, in JEM, six MPMs may be derived.Further, in JEM, when deriving the six MPMs, the most frequently usedintra prediction mode along the above neighboring row and the mostfrequently used intra prediction mode along the left neighboring columnare computed. The most frequently used intra prediction mode in theabove neighboring row is used for the available above neighboring intrapredicted prediction unit (i.e., A in Table 2) and the most frequentlyused intra prediction mode in the left neighboring column is used forthe available left neighboring intra predicted prediction unit (i.e., Lin Table 2). In JEM, MPMs may be derived based on the conditionsspecified in Table 2 below. It should be noted that in Table 2, theindex numbering of prediction modes corresponds to those defined in JEM.This is for reference purposes and should not be construed to limit thescope of the techniques described herein. Table 3, described below withrespect to FIG. 11 , provides a mapping of index values of the 35possible prediction modes defined in ITU-T H.265 and index values the 67possible prediction modes defined in JEM. It should be noted that inTable 2, Max refers to max(A, L), where max(x,y) is maximum mathematicalfunction that returns x, if x is greater than or equal to y and returnsy, if y is greater than x. Further, in Table 2, Min refers to min(A, L),where min(x,y) is minimum mathematical function that returns x, if x isless than or equal to y and returns y, if y is less than x.

TABLE 2 JEM Derivation of MPMs Conditions MPM0 MPM1 MPM2 MPM3 MPM4 MPM5L = A L ≠ Planar and L ≠ DC L Planar L + 1 L − 1 L + 2 DC OtherwisePlanar DC 50 18 2 34 (Vertical) (Horizontal) (Diagonal) L ≠ A L ≠ PlanarL = DC or L A Planar Max − 1 Max + 1 Max + 2 and A = DC R ≠ Planarotherwise L A Planar DC Max + 1 Min − 1 otherwise L + A < 2 L A 50 18 234 (Vertical) (Horizontal) (Diagonal) otherwise L A DC Max − 1 Max + 1Max + 2

In JEM, one of the six MPMs is indicated using a syntax elementindicating a MPM index value (referred to as “‘mpm_idx_jem’” herein). InJEM, a truncated unary binarization process is specified for the syntaxelement indicated a MPM index value. An example of a truncated unarybinarization process is described in further detail below. In JEM, asyntax element similar to ‘rem_intra_luma_pred_mode’ indicates one ofthe remaining 61 of the defined 67 intra prediction modes. That is, inJEM there are 61 non-MPM modes. As used herein, the term non-MPM mode isused in order to distinguish the prediction modes in a set of possibleintra prediction modes from the prediction modes in the set of possibleintra prediction modes included in a candidate list of prediction modes.In JEM, prediction mode indices of the 61 non-MPM modes are mapped to aso-called ‘mode_index_mapped_1’ value that ranges from 0 to 60. JEMspecifies a binarization for ‘mode_index_mapped_1’ that includes a fixedlength 6-bit code value and a 4-bit code value. In JEM, the 4-bit codecorresponds to the last value (i.e., 60) of ‘mode_index_mapped_1’ andthe fixed length 6-bit code value corresponds to values 0-59 of‘mode_index_mapped_1’. It should be noted that in JEM, a value “1111” isused for the 4-bit code value and as such the following four codewordsare not used for the 6-bit fixed length code values: 111100, 111101,111110, and 111111. A value of ‘mode_index_mapped_1’ is sent to adecoder to indicate a particular intra prediction mode index. A decoderreceiving ‘mode_index_mapped_1’ may parse a codeword by determiningwhether the first four bits of the codeword equal to “1111.” If thefirst four bits are equal to “1111” then ‘mode_index_mapped_1’ isdetermined to be “60.” If the first four bits are not equal to “1111,”the decoder may parse the remaining two bits to determine the value of‘mode_index_mapped_1’.

As described above, the techniques described herein may be generallyapplicable regardless of the number of possible intra prediction modes.FIG. 11 is a conceptual diagram illustrating a set of possible intraprediction modes. As illustrated in FIG. 11 , a set of possibleprediction modes includes non-directional prediction modes (e.g.,predMode: 0 to predMode: N) and directional prediction modes (e.g.,predMode: N+1 to predMode: Z). As further illustrated in FIG. 11 ,possible directional prediction modes may be defined with respect toreferencing a vertical (VER), a horizontal (HOR), and one or morediagonal (DIA) angular prediction modes and a set of density values. Forexample, with reference to FIG. 11 , a set of possible angularprediction modes may be described by specifying angles for each ofDiagonal (−H, V), Vertical, Diagonal (H,V), Horizontal, and Diagonal (H,−V) and specifying a value for each of Density A, Density B, Density C,and Density D. Table 3 provides an example where Diagonal (−H, V),Vertical, Diagonal (H, V), Horizontal, and Diagonal (H, −V) correspondto angular prediction modes defined in ITU-T H.265 and JEM. It should benoted that in other examples, Diagonal (−H, V), Vertical, Diagonal (H,V), Horizontal, and Diagonal (H, −V) may correspond to angles other thanthose defined in ITU-T H.265 and JEM. For example, in some examples theangle between Diagonal (−H, V) and Diagonal (H, −V) may be greater thanthe angle between intra prediction mode 2 and intra prediction mode 34in ITU-T H.265.

TABLE 3 Map of Mode Indices Common ITU-T H.265 JEM FIG. 10 Mode NameMode Index Mode Index Mode Index Planar_IDX  0  0 0 DC_IDX  1  1 1 . . .N/A N/A . . . HDIA_IDX  2  2 Diagonal (H, −V) . . . . . . . . . . . .HOR_IDX 10 18 Horizontal . . . . . . . . . . . . DIA_IDX 18 34 Diagonal(H,V) . . . . . . . . . . . . VER_IDX 26 50 Vertical . . . . . . . . . .. . VDIA_IDX 34 66 Diagonal (−H,V)

In the example illustrated in FIG. 11 , a density function may be usedto define the number and angular spacing of angular prediction modeslocated between two reference angular prediction modes. As describedabove, ITU-T H.265 defines 33 possible angular prediction modes and JEMdefines 65 possible angular prediction modes. According to thetechniques described herein a defined set of possible angular predictionmodes may have various densities, that is, each of Density A, Density B,Density C, and Density D in FIG. 11 may specify a different number ofangular prediction modes, each having a specified angular spacingbetween angular prediction modes. For example, Density A and Density Cmay specify the respective corresponding seven angular prediction modesdefined in ITU-T H.265, and Density B and Density D may specify therespective corresponding fifteen angular prediction modes defined inJEM.

In addition to generating reference samples according to a predictionmode (which may be referred to as an intra prediction block), intraprediction coding may include modifying reference samples prior togenerating residual data (e.g., during encoding) and/or modifyingreference samples prior to reconstructing a video block (e.g., duringdecoding). Such modifications may be referred to as reference samplesmoothing. One example of modifying reference samples includes so-calledboundary smoothing. Boundary smoothing includes modifying samplesincluded in one or more rows or columns at the boundary or edge of anintra prediction block. In ITU-T H.265, after an intra prediction blockhas been generated using the vertical intra mode (i.e., mode 26 in ITU-TH.265) samples included in the left-most column of the intra predictionblock may be modified according to Equation (1).predSamples[0][y]=Clip1Y(p[x][−1]+((p[−1][y]−p[−1][−1])>>1))  (1)

Further in ITU-T H.265, after the intra prediction block has beengenerated using the horizontal intra mode (i.e., mode 10 in ITU-T H.265)samples included in the top-most row of the intra prediction block maybe modified according to Equation (2).predSamples[x][0]=Clip1Y(p[−1][y]+((p[x][−1]−p[−1][−1])>>1))  (2)

Further, in ITU-T H.265, after the intra prediction block has beengenerated using the DC intra mode (i.e., mode 1 in ITU-T H.265), whichincludes generating an average value, for samples in a current block(i.e., dcVal in Equations (3)-(4)), samples included in the left-mostcolumn of the intra prediction block may be modified according toEquation (3) and samples included in the top-most row of the intraprediction block may be modified according to Equation (4).predSamples[0][y]=(p[−1][y]+3*dcVal+2)>>2  (3)predSamples[x][0]=(p[x][−1]+3*dcVal+2)>>2  (4)

In each of Equations (1)-(4) and equations below, predSamples[0][y] andpredSamples[x][0] respectively provide luma sample values in a column orrow, p[x][y] provides values of corresponding samples (e.g., neighboringsamples), and the x>>y operation represents an arithmetic right shift ofa two's complement integer representation of x by y binary digits. Itshould be noted that in some cases an arithmetic right shift of a two'scomplement integer representation of x by y binary digits may beequivalent to a division of an integer in decimal notation by 2y. InEquations (1) and (2), Clip1Y(x) represents a clipping function, whereClip1Y(x) returns x clipped between 0 and the bit depth of luma. Thatis, if x is smaller than 0, then return 0; if x is greater than the bitdepth of luma minus 1, then return bit depth of luma −1; if x is notsmaller than 0 and x is not greater than the bit depth of luma minus 1,then return x. Thus, Equations (1)-(4) provide examples of how samplevalues included in a boundary row or column may be modified (i.e.,smoothed).

In JEM, boundary smoothing for the horizontal intra mode (i.e., mode 18in JEM) is further extended to include smoothing of boundary samples inup to four rows. That is, in JEM, after the intra prediction block hasbeen generated using the horizontal intra mode, samples included in thefour top-most rows of the intra prediction block may be modifiedaccording to Equations (5)-(8).predSamples[x][0]=(f1*p[x][0]+f2*p[x][−1]+8)>>4; (where f1=f2=8)  (5)predSamples[x][1]=(f1*p[x][1]+f2*p[x][−1]+8)>>4; (where f1=12,f2=4)  (6)predSamples[x][2]=(f1*p[x][2]+f2*p[x][−1]+8)>>4; (where f1=14,f2=2)  (7)predSamples[x][3]=(f1*p[x][3]+f2*p[x][−1]+8)>>4; (where f1=15,f2=1)  (8)

In JEM, boundary smoothing for the vertical intra mode (i.e., mode 50 inJEM) is further extended to include smoothing of boundary samples in upto four columns. That is, in JEM, after the intra prediction block hasbeen generated using the vertical intra mode, samples included in thefour left-most columns of the intra prediction block may be modifiedaccording to Equations (9)-(12).predSamples[0][y]=(f1*p[0][y]+f2*p[−1][y]+8)>>4; (Here f1=f2=8)  (9)predSamples[1][y]=(f1p[1][y]+f2*p[−1][y]+8)>>4; (Here f1=12, f2=4)  (10)predSamples[2][y]=(f1*p[2][y]+f2*p[−1][y]+8)>>4; (Here f1=14,f2=2)  (11)predSamples[3][y]=(f1*p[3][y]+f2*p[4][y]+8)>>4; (Here f1=15, f2=1)  (12)

Further, in JEM, boundary smoothing may be applied for intra predictionblocks generated using other prediction modes. In JEM, for intraprediction blocks generated using prediction mode 2 (i.e., HDIA_IDX inTable 3) samples included in the four top-most rows of the intraprediction block may be modified according to Equations (5)-(8) and forintra prediction blocks using prediction mode 66 (i.e., VDIA_IDX inTable 3) samples included in the four left-most columns of the intraprediction block may be modified according to Equations (9)-(12). In JEMrespective for intra prediction blocks generated using prediction modesneighboring prediction mode 2, i.e., prediction modes corresponding toprediction modes 3 to 6 in ITU-T H.265, the top-most row of the intraprediction block may be modified according to Equation (13).predSamples[x][0]=(f1*p[x][0]+f2*p[x+offset0][−1]+f3*p[x+offset1][−1]+8)>>4,  (13)where:when mode is equal to 3, f1=12, f2=3, f3=1, offset0=2, offset1=3when mode is equal to 4, f1=12, f2=3, f3=1, offset0=2, offset1=3when mode is equal to 5, f1=12, f2=1, f3=3, offset0=1, offset1=2when mode is equal to 6, f1=12, f2=2, f3=2, offset0=1, offset1=2

In JEM respective for intra prediction blocks generated using predictionmodes neighboring prediction mode 66, i.e., prediction modescorresponding to prediction modes 30 to 33 in ITU-T H.265, left-mostcolumn of the intra prediction block may be modified according toEquation (14).predSamples[0][y]=(f1*p[0][y]+f2*p[−1][y+offset0]+f3*p[−1][y+offset2]+8)>>4,  (14)

where:

when mode is equal to 30, f1=12, f=2, f3=2, offset0=1, offset1=2

when mode is equal to 31, f1=12, f2=3, f3=1, offset0=1, offset1=2

when mode is equal to 32, f1=8, f2=6, f3=2, offset0=1, offset1=2

when mode is equal to 33, f1=8, f2=7, f3=1, offset0=1, offset1=2

It should be noted that whether a boundary smoothing filter is appliedmay be based on the size of a PU or CB. For example, in ITU-T H.265 andJEM, the boundary smoothing filters described above are applied when aTB size is smaller than 32×32. Table 4 provides a summary of boundarysmoothing filters that may be applied in ITU-T H.265 and JEM,respectively.

TABLE 4 Boundary filters Mode Indices ITU-T H.265 JEM Common Mode IndexMode Index Mode Name (Boundary Filter) (Boundary Filter) DC_IDX  1  1(Equations (3)-(4)) (Equations (3)-(4)) HDIA_IDX  2  2 (No Filter)(Equations (5)-(8)) HDIA_IDX 3-6 ~3-10 Neighbors (No Filter) (Equation(13)) . . . . . . . . . HOR_IDX 10 18 (Equations (2)) (Equations(5)-(8)) . . . . . . . . . DIA_IDX 18 34 (No Filter) (No Filter) . . . .. . . . . VER_IDX 26 50 (Equations (2)) (Equations (9)-(12)) . . . . . .. . . VDIA_IDX 30-33 ~58-65  Neighbors (No Filter) (Equation (14))VDIA_IDX 34 66 (No Filter) (Equation (9)-(12))

Another example of modifying reference samples prior to generating aresidual data and/or modifying reference samples prior to reconstructinga video block includes so-called inner pixel smoothing. It should benoted that in some examples, inner pixels may be inclusive of samplesincluded in a boundary column or boundary row and in some examples,inner pixels may not be inclusive of samples included in a boundarycolumn or boundary row. One example of inner pixel smoothing includesso-called Multi-parameter intra (MPI). MPI is described in K. McCann,W.-J. Han, I.-K. Kim, J.-H. Min, E. Alshina, A. Alshin, T. Lee, J. Chen,V. Seregin, S. Lee, Y.-M. Hong, M.-S. Cheon, N. Shlyakhov, “Video codingtechnology proposal by Samsung (and BBC)” Joint Collaborative Team onVideo Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11,JCTVC-A124, Dresden, Germany, 15-23 Apr. 2010, which is incorporated byreference herein. MPI may include recursively modifying sample values inan intra prediction block according to Equation (15). It should be notedthat with respect to modifying sample values in an intra predictionblock according to Equation (15), recursively refers to modifying samplevalues as follows: modify predSamples [−1][4], modify predSamples[−2][4], modify predSamples [4][−2], etc. That is, samples are modifiedrecursively from top-left samples to the bottom-right samples.predSamples[x][y]=(p[x][y]+p[x−1][y]+p[x][y−1]+pred[x][y+1]+2)>>2  (15)

In addition to generating a prediction block according to a predictionmode and modifying reference samples prior to generating residual data,intra prediction techniques may include generating a predictive videoblock using a weight combination of unfiltered and filtered referencesamples. One example technique generating a predictive video block usinga weight combination of unfiltered and filtered reference samplesincludes so-called Position Dependent Intra Prediction (PDPC). PDPC isdescribed in JEM 1.

In PDPC, a predictive video block is generated according to Equation(16). In Equation (16), r[x][y] represents reference samples generatedfor a directional prediction mode using unfiltered reference samples andq[x][y] represents reference samples generated for the directionalprediction mode using filtered reference samples.predSamples [x][y]={(c ₁ ^((v)) »└y/d┘)r[x,−1]−(c ₂ ^((v))»└y/d┘)r[−1,−1]+(c ₁ ^((h)) »└x/d┘)r[−1,y]−(c ₂ ^((h))»└x/d┘)r[−1,−1]+b[x,y]q[x,y]+64}»7  (16)

-   -   where c₁ ^(v), c₂ ^(v), c₁ ^(h), c₂ ^(h) are stored prediction        parameters, d=1 for block sizes up to 16×16, and d=2 for larger        blocks, and        b[x,y]=128−(c ₁ ^((v)) »└y/d┘)+(c ₂ ^((v)) »└y/d┘)−(c ₁ ^((v))        »└y/d┘)+(c ₂ ^((h)) »└y/d┘)    -   is a normalization factor.

The prediction parameters, c_1{circumflex over ( )}v, c_2{circumflexover ( )}v, c_1{circumflex over ( )}h, c_2{circumflex over ( )}h, aredefined per prediction direction and block size. In JEM, one set ofprediction parameters is defined per intra prediction mode and blocksize. Further, it should be noted that in JEM, a CU level flag,‘PDPC_idx’, indicates whether PDPC is applied or not, where a value of 0indicates that an existing ITU-T H.265 intra prediction is used and avalue of 1 indicates the PDPC is applied.

FIG. 12 is a conceptual diagram illustrating examples of generating anintra prediction block and examples of smoothing an intra predictionblock using intra prediction techniques. As illustrated in FIG. 12 , anintra prediction block may be generated using a vertical prediction mode(i.e., the intra prediction block includes columns of samples havingvalues corresponding the respective values in the row of neighboringsamples). Boundary smoothing may be performed on the intra predictionblock (i.e., the left column of the intra prediction block is smoothed).Inner pixel smoothing may be performed on the intra prediction block(i.e., interior pixels are smoothed based on neighboring sample values).Further, as illustrated in FIG. 12 , a filtered reference intraprediction block may be generated. In the example illustrated in FIG. 12, a filtered reference intra prediction block is generated by averaginga reference value with a left neighboring sample value (i.e., samples incolumn four are equal to (206+132)/2). As further illustrated in FIG. 12, a predictive video block may be generated by combining an intraprediction block including unfiltered reference samples and an intraprediction block including filtered reference samples. The techniquesdescribed herein may be generally applicable for generating an intraprediction block and smoothing an intra prediction block.

As described above, intra prediction data or inter prediction data mayassociate an area of a picture (e.g., a PB or a CB) with correspondingreference samples. For inter prediction coding, a motion vector (MV)identifies reference samples in a picture other than the picture of avideo block to be coded and thereby exploits temporal redundancy invideo. For example, a current video block may be predicted from areference block located in a previously coded frame and a motion vectormay be used to indicate the location of the reference block. A motionvector and associated data may describe, for example, a horizontalcomponent of the motion vector, a vertical component of the motionvector, a resolution for the motion vector (e.g., one-quarter pixelprecision), a prediction direction and/or a reference picture indexvalue. Further, a coding standard, such as, for example ITU-T H.265, maysupport motion vector prediction. Motion vector prediction enables amotion vector to be specified using motion vectors of neighboringblocks. Examples of motion vector prediction include advanced motionvector prediction (AMVP), temporal motion vector prediction (TMVP),so-called “merge” mode, and “skip” and “direct” motion inference.Further, JEM supports advanced temporal motion vector prediction (ATMVP)and Spatial-temporal motion vector prediction (STMVP).

As described above, residual data generated for an area of a pictureusing a prediction and corresponding reference samples may betransformed to generate transform coefficients. As further describedabove, in JEM, whether a subsequent secondary transform is applied togenerate transform coefficients may be dependent on a prediction mode.Transform coefficients may be generated using transform matricesassociated with a transform set. In JEM, one of 12 transform sets, eachset for non-directional modes including two transform matrices and eachset for directional modes including three transform matrices, may bemapped to the 67 intra prediction modes described above. Table 5illustrates how one of the 12 transform sets are mapped to predictionmodes in JEM.

TABLE 5 Intra mode 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 SetIndex 0 0 1 2 1 2 1 2 3 4 3 4 3 4 5 5 5 6 6 Intra mode 19 20 21 22 23 2425 26 27 28 29 30 31 32 33 34 35 36 37 Set Index 6 7 7 7 8 9 8 9 8 9 1011 10 11 10 11 10 11 10 Intra mode 38 39 40 41 42 43 44 45 46 47 48 4950 51 52 53 54 55 56 Set Index 11 10 9 8 9 8 9 8 7 7 7 6 6 6 5 5 5 4 3Intra mode 57 58 59 60 61 62 63 64 65 66 Set Index 4 3 4 3 2 1 2 1 2 1

In JEM, applying a subsequent secondary transform may include performinga secondary transform independently for each 4×4 sub-group of transformcoefficients, performing a secondary transform independently may bereferred to as applying Non-Separable Secondary Transform (NSST). InJEM, a 2-bit CU-level index value (referred to as “‘NSST_idx’” herein)is included in the bitstream to indicate a transform matrix for atransform set. It should be noted that in JEM, ‘NSST_idx’ is signaledonce per intra CU and is included in a bitstream after the correspondingtransform coefficients. Further, in JEM, a value of zero for ‘NSST_idx’indicates that a secondary transform is not applied to the current CU.As described above, one example technique for in JEM includes PDPC, itshould be noted that in JEM, NSST is only enabled when PDPC is notapplied (i.e., the value of ‘PDPC_idx’ is set equal to zero).

As described above, syntax elements may be entropy coded according to anentropy encoding technique. As described above, a binarization processmay be performed on syntax elements as part of an entropy codingprocess. Binarization is a lossless process and may include one or acombination of the following coding techniques: fixed length coding,unary coding, truncated unary coding, truncated Rice coding, Golombcoding, k-th order exponential Golomb coding, and Golomb-Rice coding. Asused herein each of the terms fixed length coding, unary coding,truncated unary coding, truncated Rice coding, Golomb coding, k-th orderexponential Golomb coding, and Golomb-Rice coding may refer to generalimplementations of these techniques and/or more specific implementationsof these coding techniques. For example, a Golomb-Rice codingimplementation may be specifically defined according to a video codingstandard, for example, ITU-T H.265. Table 6 provides an example ofdifferent binarizations. For the sake of brevity, formal definitions ofthe binarizations are not provided herein, however, reference is made toITU-T H.265 for examples of formal definitions of binarizations. Thetechniques described herein may be generally applicable to bin valuesgenerated using any binarization coding technique. In Table 6, forvalues of N a bin string is provided for each of the examplebinarizations, where cMax is the largest possible value of the syntaxelement and k is a parameter associated with the binarization.

TABLE 6 Example of different Binarizations Truncated Truncated Rice Exp-Fixed- Unary k = 1, Golomb Length N Unary cMax = 7 cMax = 7 k = 0 cMax =7 0 0 0 00 1 000 1 10 10 01 010 001 2 110 110 100 011 010 3 1110 1110101 00100 011 4 11110 11110 1100 00101 100 5 111110 111110 1101 00110101 6 1111110 1111110 1110 00111 110 7 11111110 1111111 1111 0001000 111

After binarization, a CABAC entropy encoder may select a context model.For a particular bin, a context model may be selected from a set ofavailable context models associated with the bin. In some examples, acontext model may be selected based on a previous bin and/or values ofprevious syntax elements. For example, a context model may be selectedbased on the value of a neighboring intra prediction mode. A contextmodel may identify the probability of a bin being a particular value.For instance, a context model may indicate a 0.7 probability of coding a0-valued bin and a 0.3 probability of coding a 1-valued bin. Afterselecting an available context model, a CABAC entropy encoder mayarithmetically code a bin based on the identified context model. Itshould be noted that some syntax elements may be entropy encoded usingarithmetic encoding without the usage of an explicitly assigned contextmodel, such coding may be referred to as bypass coding.

As described above, in ITU-T H.265, a truncated rice binarizationprocess is specified for ‘mpm_idx’, and a fixed length binarizationprocess is defined for ‘rem_intra_luma_pred_mode’. Further, as describedabove, in JEM, a truncated unary binarization process is specified for‘mpm_idx_jem’ and a fixed length binarization is specified for‘mode_index_mapped_1’. In JEM, for ‘mpm_idx_jem’, the first three binsare coded with context models that depend on the left and aboveneighboring intra mode predictions, and the remaining bins are bypasscoded and ‘mode_index_mapped_1’ is coded using bypass coding. As furtherdescribed above, in JEM, ‘NSST_idx’ is used to indicate a transformmatrix for a transform set for NSST, where ‘NSST_idx’ has a value of 0,1, or 2 for the DC and planar prediction modes and has a value of 0, 1,2, or 3 for the directional prediction modes. In the cases where‘NSST_idx’ has a value of 0, 1, or 2, a truncated unary binarization isused and a context model is used to code each bin. In the cases where‘NSST_idx’ has a value of 0, 1, 2, or 3 (i.e., a directional predictionmode is used), a fixed length binarization (i.e., 00, 01, 10, 11) isused and a context model is used to code each bin.

The techniques described herein may be used to more perform intraprediction coding. In one example, the techniques described herein maybe used to more efficiently code intra prediction data, including syntaxelements indicating an intra prediction mode. In one example, thetechniques described herein may be used to modify intra predictionblocks using filtering techniques. It should be noted that because avideo sequence may include several pictures that are coded using intraprediction techniques, by more efficiently performing intra predictioncoding, overall coding efficiency may be improved.

FIG. 1 is a block diagram illustrating an example of a system that maybe configured to code (i.e., encode and/or decode) video data accordingto one or more techniques of this disclosure. System 100 represents anexample of a system that may code syntax elements according to one ormore techniques of this disclosure. As illustrated in FIG. 1 , system100 includes source device 102, communications medium 110, anddestination device 120. In the example illustrated in FIG. 1 , sourcedevice 102 may include any device configured to encode video data andtransmit encoded video data to communications medium 110. Destinationdevice 120 may include any device configured to receive encoded videodata via communications medium 110 and to decode encoded video data.Source device 102 and/or destination device 120 may include computingdevices equipped for wired and/or wireless communications and mayinclude set top boxes, digital video recorders, televisions, desktop,laptop, or tablet computers, gaming consoles, mobile devices, including,for example, “smart” phones, cellular telephones, personal gamingdevices, and medical imagining devices.

Communications medium 110 may include any combination of wireless andwired communication media, and/or storage devices. Communications medium110 may include coaxial cables, fiber optic cables, twisted pair cables,wireless transmitters and receivers, routers, switches, repeaters, basestations, or any other equipment that may be useful to facilitatecommunications between various devices and sites. Communications medium110 may include one or more networks. For example, communications medium110 may include a network configured to enable access to the World WideWeb, for example, the Internet. A network may operate according to acombination of one or more telecommunication protocols.Telecommunications protocols may include proprietary aspects and/or mayinclude standardized telecommunication protocols. Examples ofstandardized telecommunications protocols include Digital VideoBroadcasting (DVB) standards, Advanced Television Systems Committee(ATSC) standards, Integrated Services Digital Broadcasting (ISDB)standards, Data Over Cable Service Interface Specification (DOCSIS)standards, Global System Mobile Communications (GSM) standards, codedivision multiple access (CDMA) standards, 3rd Generation PartnershipProject (3GPP) standards, European Telecommunications StandardsInstitute (ETSI) standards, Internet Protocol (IP) standards, WirelessApplication Protocol (WAP) standards, and Institute of Electrical andElectronics Engineers (IEEE) standards.

Storage devices may include any type of device or storage medium capableof storing data. A storage medium may include a tangible ornon-transitory computer-readable media. A computer readable medium mayinclude optical discs, flash memory, magnetic memory, or any othersuitable digital storage media. In some examples, a memory device orportions thereof may be described as non-volatile memory and in otherexamples portions of memory devices may be described as volatile memory.Examples of volatile memories may include random access memories (RAM),dynamic random access memories (DRAM), and static random access memories(SRAM). Examples of non-volatile memories may include magnetic harddiscs, optical discs, floppy discs, flash memories, or forms ofelectrically programmable memories (EPROM) or electrically erasable andprogrammable (EEPROM) memories. Storage device(s) may include memorycards (e.g., a Secure Digital (SD) memory card), internal/external harddisk drives, and/or internal/external solid state drives. Data may bestored on a storage device according to a defined file format.

Referring again to FIG. 1 , source device 102 includes video source 104,video encoder 106, and interface 108. Video source 104 may include anydevice configured to capture and/or store video data. For example, videosource 104 may include a video camera and a storage device operablycoupled thereto. Video encoder 106 may include any device configured toreceive video data and generate a compliant bitstream representing thevideo data. A compliant bitstream may refer to a bitstream that a videodecoder can receive and reproduce video data therefrom. Aspects of acompliant bitstream may be defined according to a video coding standard.When generating a compliant bitstream video encoder 106 may compressvideo data. Compression may be lossy (discernible or indiscernible) orlossless. Interface 108 may include any device configured to receive acompliant video bitstream and transmit and/or store the compliant videobitstream to a communications medium. Interface 108 may include anetwork interface card, such as an Ethernet card, and may include anoptical transceiver, a radio frequency transceiver, or any other type ofdevice that can send and/or receive information. Further, interface 108may include a computer system interface that may enable a compliantvideo bitstream to be stored on a storage device. For example, interface108 may include a chipset supporting Peripheral Component Interconnect(PCI) and Peripheral Component Interconnect Express (PCIe) busprotocols, proprietary bus protocols, Universal Serial Bus (USB)protocols, I2C, or any other logical and physical structure that may beused to interconnect peer devices.

Referring again to FIG. 1 , destination device 120 includes interface122, video decoder 124, and display 126. Interface 122 may include anydevice configured to receive a compliant video bitstream from acommunications medium. Interface 108 may include a network interfacecard, such as an Ethernet card, and may include an optical transceiver,a radio frequency transceiver, or any other type of device that canreceive and/or send information. Further, interface 122 may include acomputer system interface enabling a compliant video bitstream to beretrieved from a storage device. For example, interface 122 may includea chipset supporting PCI and PCIe bus protocols, proprietary busprotocols, USB protocols, I2C, or any other logical and physicalstructure that may be used to interconnect peer devices. Video decoder124 may include any device configured to receive a compliant bitstreamand/or acceptable variations thereof and reproduce video data therefrom.Display 126 may include any device configured to display video data.Display 126 may comprise one of a variety of display devices such as aliquid crystal display (LCD), a plasma display, an organic lightemitting diode (OLED) display, or another type of display. Display 126may include a High Definition display or an Ultra High Definitiondisplay. It should be noted that although in the example illustrated inFIG. 1 , video decoder 124 is described as outputting data to display126, video decoder 124 may be configured to output video data to varioustypes of devices and/or sub-components thereof. For example, videodecoder 124 may be configured to output video data to any communicationmedium, as described herein.

FIG. 2 is a block diagram illustrating an example of video encoder 200that may implement the techniques for encoding video data describedherein. It should be noted that although example video encoder 200 isillustrated as having distinct functional blocks, such an illustrationis for descriptive purposes and does not limit video encoder 200 and/orsub-components thereof to a particular hardware or softwarearchitecture. Functions of video encoder 200 may be realized using anycombination of hardware, firmware, and/or software implementations. Inone example, video encoder 200 may be configured to encode intraprediction data.

Video encoder 200 may perform intra prediction coding and interprediction coding of picture areas, and, as such, may be referred to asa hybrid video encoder. In the example illustrated in FIG. 2 , videoencoder 200 receives source video blocks. In some examples, source videoblocks may include areas of picture that has been divided according to acoding structure. For example, source video data may includemacroblocks, CTUs, CBs, sub-divisions thereof, and/or another equivalentcoding unit. In some examples, video encoder may be configured toperform additional sub-divisions of source video blocks. It should benoted that the techniques described herein are generally applicable tovideo coding, regardless of how source video data is partitioned priorto and/or during encoding. In the example illustrated in FIG. 2 , videoencoder 200 includes summer 202, transform coefficient generator 204,coefficient quantization unit 206, inverse quantization/transformprocessing unit 208, summer 210, intra prediction processing unit 212,inter prediction processing unit 214, post filter unit 216, and entropyencoding unit 218. As illustrated in FIG. 2 , video encoder 200 receivessource video blocks and outputs a bitstream.

In the example illustrated in FIG. 2 , video encoder 200 may generateresidual data by subtracting a predictive video block from a sourcevideo block. The selection of a predictive video block is described indetail below. Summer 202 represents a component configured to performthis subtraction operation. In one example, the subtraction of videoblocks occurs in the pixel domain. Transform coefficient generator 204applies a transform, such as a discrete cosine transform (DCT), adiscrete sine transform (DST), or a conceptually similar transform, tothe residual block or sub-divisions thereof (e.g., four 8×8 transformsmay be applied to a 16×16 array of residual values) to produce a set ofresidual transform coefficients. Transform coefficient generator 204 maybe configured to perform any and all combinations of the transformsincluded in the family of discrete trigonometric transforms. Asillustrated in FIG. 2 , transform coefficient generator 204 may beconfigured to receive intra prediction data. In this manner, transformcoefficient generator 204 may be configured to perform one of moretransforms on residual data based on an intra prediction mode. In oneexample, one of 12 transform sets may be mapped to the 67 intraprediction modes described above with respect to JEM. Transformcoefficients may be generated using the transform matrices associatedwith a transform set. In some examples, transform coefficient generator204 may be configured to subsequently apply secondary transform afterapplying transform matrices associated with a transform set, i.e., applya subsequent secondary transform after applying a core transform. In oneexample, applying a subsequent secondary transform may includeperforming a secondary transform independently for each 4×4 sub-group oftransform coefficients, as described above. It should be noted that insome examples other sizes of sub-groups may be used (e.g., 8×8sub-groups) for secondary transforms. In one example, transformcoefficient generator 204 may be configured to apply the NSST describedabove, or another subsequent transform, for a set of intra predictionmodes. In one example, transform coefficient generator 204 may beconfigured to apply the NSST described above, or another subsequenttransform, for a set of intra prediction modes independent of whetherPDPC is applied. Further, it should be noted that in some examples,whether a subsequent transform may be applied for a set of intraprediction modes may be used to define a set of prediction modesdescribed above. For example, Set 1, Set 2, and Set 3 described belowwith respect to Table 8A may correspond to respective transform sets ofsubsequent transforms.

Transform coefficient generator 204 may output transform coefficients tocoefficient quantization unit 206. Further, as illustrated in FIG. 2 ,transform coefficient generator 204 may output transform data, forexample, an index value indicating a transform matrix to inversequantization/transform processing unit 208 and entropy encoding unit218. Coefficient quantization unit 206 may be configured to performquantization of the transform coefficients. The quantization process mayreduce the bit depth associated with some or all of the coefficients.The degree of quantization may alter the rate-distortion (i.e., bit-ratevs. quality of video) of encoded video data. The degree of quantizationmay be modified by adjusting a quantization parameter (QP). Asillustrated in FIG. 2 , quantized transform coefficients are output toinverse quantization/transform processing unit 208. Inversequantization/transform processing unit 208 may be configured to apply aninverse quantization and an inverse transformation to generatereconstructed residual data. As illustrated in FIG. 2 , at summer 210,reconstructed residual data may be added to a predictive video block. Inthis manner, an encoded video block may be reconstructed and theresulting reconstructed video block may be used to evaluate the encodingquality for a given prediction, transformation, and/or quantization.Video encoder 200 may be configured to perform multiple coding passes(e.g., perform encoding while varying one or more of a prediction,transformation parameters, and quantization parameters). Therate-distortion of a bitstream or other system parameters may beoptimized based on evaluation of reconstructed video blocks. Further,reconstructed video blocks may be stored and used as reference forpredicting subsequent blocks.

As described above, a video block may be coded using an intraprediction. Intra prediction processing unit 212 may be configured toselect an intra prediction mode for a video block to be coded. Intraprediction processing unit 212 may be configured to evaluate a frame anddetermine an intra prediction mode to use to encode a current block. Asdescribed above, possible intra prediction modes may include planarprediction modes, a DC prediction modes, and angular prediction modes.Further, it should be noted that in some examples, a prediction mode fora chroma component may be inferred from an intra prediction mode for aluma prediction mode. Intra prediction processing unit 212 may select anintra prediction mode after performing one or more coding passes.Further, in one example, intra prediction processing unit 212 may selecta prediction mode based on a rate-distortion analysis. As illustrated inFIG. 2 , intra prediction processing unit 212 outputs intra predictiondata (e.g., syntax elements) to entropy encoding unit 220 and transformcoefficient generator 204. As described above, a transform performed onresidual data may be mode dependent.

FIG. 3 is a block diagram illustrating an example of an intra predictionprocessing unit that may be configured to perform intra predictioncoding according to one or more techniques of this disclosure. That is,for example, intra prediction processing unit 300 may be configured toencode intra prediction data. As illustrated in FIG. 3 , intraprediction processing unit 300 includes intra estimation unit 302, intraprediction unit 304, mode encoding unit 306, and filtering unit 308. Itshould be noted that although example intra prediction processing unit300 is illustrated as having distinct functional blocks, such anillustration is for descriptive purposes and does not limit intraprediction processing unit 300 and/or sub-components thereof to aparticular hardware or software architecture. Functions of intraprediction processing unit 300 may be realized using any combination ofhardware, firmware, and/or software implementations.

Intra estimation unit 302 may be configured to receive source videoblocks, including a video block to be encoded, which may be referred toas a current video block, and reconstructed video blocks. Reconstructedvideo blocks may include video blocks that will be available, e.g., froma decoded bitstream, when the current video is decoded and reconstructedvideo blocks from possible encodings of the current video block. Intraestimation unit 302 may evaluate the coding efficiency of the currentvideo block for one or more possible encodings and select an intraprediction mode after performing one or more coding passes. In oneexample, intra estimation unit 302 may select one of the possible intraprediction modes described above (e.g., one of the 67 prediction modesdescribed above with respect to JEM). Further, intra estimation unit 302may be configured to select a prediction mode from possible intraprediction modes including any number of non-directional predictionmodes (e.g., two or more fitting or averaging modes) and any number ofdirectional prediction modes (e.g., 35 or more angular predictionmodes). Intra prediction unit 304 may be configured to receive selectedintra prediction mode and generate a reference video block.

As described above, in some examples, an intra prediction mode may beinferred from a neighboring intra predicted prediction unit by derivinga list of candidate intra prediction modes based on neighboring intrapredicted prediction units. Intra estimation unit 302 may be configuredto derive candidate intra prediction modes based on prediction modes ofneighboring intra predicted prediction units according to the techniquesdescribed above (i.e., derive MPMs). Further, in some examples, intraestimation unit 302 may be configured to further derive one or more setsof non-MPM prediction modes. For example, when possible prediction modesinclude 35 prediction modes and a candidate list of prediction modesbased on prediction modes of neighboring intra predicted predictionunits includes three prediction modes, intra estimation unit 302 may beconfigured to further derive one or more sets of prediction modes forthe 32 prediction modes that are not included in the candidate list ofprediction modes. Further, when possible prediction modes include 67prediction modes and a candidate list of prediction modes based onprediction modes of neighboring intra predicted prediction units include6 prediction modes, intra estimation unit 302 may be configured tofurther derive one or more sets of prediction modes for the 61prediction modes that are not included in the candidate list ofprediction modes. More generally, when possible intra prediction modesinclude Z prediction modes and a candidate list of prediction modesbased on prediction modes of neighboring intra predicted predictionunits includes X prediction modes, intra estimation unit 302 may beconfigured to further derive one or more sets of prediction modes forthe Z-X prediction modes that are not included in the candidate list ofprediction modes.

In one example, deriving one or more sets of non-MPM prediction modesmay include determining a number of sets, for each set, determining anumber of non-MPM prediction modes that will be included in the set anddetermining which particular non-MPM modes will be included in the set.In some examples, deriving one or more sets of non-MPM prediction modesmay be based on the conditions provided for deriving MPM candidatelists. Table 7 provides an example where non-MPM modes are mapped to oneor more sets based on the conditions provided from deriving a MPMcandidate list. The example illustrated in Table 7 is based on the MPMderivation described above with respect to ITU-T H.265. Each setillustrated in Table 7 includes one or more of 32 possible intraprediction modes defined for ITU-T H.265, i.e., one or more non-MPMmodes.

TABLE 7 non-MPM Conditions MPM0 MPM1 MPM2 Set Mapping L = A L ≠ Planarand L ≠ DC L 2 + ((L + 29) % 32) 2 + ((L − 1) % 32) Set 0 OtherwisePlanar DC 26 Set 1, Set 2, (Vertical) Set 3 L ≠ A L ≠ Planar L A PlanarSet 4, Set 5, and R ≠ Planar otherwise L + A < 2 L A 26 Set 6, Set 7,(Vertical) Set 8 otherwise L A DC Set 9, Set 10

As described above, with respect to ITU-T H.265 and JEM, when aprediction other than a MPM is use, a fixed length syntax element isused to indicate an intra prediction mode (i.e., 5-bit fixed length code‘rem_intra_luma_pred_mode’ may indicate one of 32 intra prediction modesin ITU-T H.265 and a 6-bit fixed length code may indicate one of 61prediction modes in JEM). Each of the one or more derived sets ofnon-MPM prediction modes may be associated with a particularbinarization. That is, deriving one or more sets of prediction modes fornon-MPM prediction modes may enable non-MPM prediction modes to besignaled more efficiently. Referring to the example illustrated in Table7, when L=A, and the condition L≠Planar and L≠DC is not true, Set 1, Set2 and Set 3 are derived for the non-MPM modes. Table 8A provides anexample particular binarization for each of Set 1, Set 2, and Set 3.

TABLE 8A ITU-T H.265 Binarization Codeword  0 MPM TR 0  1 MPM TR 10  2Set 1 TU 0  3 Set 1 TU 01  4 Set 1 TU 001  5 Set 1 TU 000  6 Set 2 TU 0 7 Set 2 TU 01  8 Set 2 TU 001  9 Set 2 TU 0001 10 Set 2 TU 00001 11 Set2 TU 000001 12 Set 2 TU 0000001 13 Set 2 TU 00000001 14 Set 2 TU000000001 15 Set 2 TU 0000000001 16 Set 2 TU 00000000001 17 Set 2 TU000000000001 18 Set 2 TU 000000000000 19 Set 3 FL 0000 20 Set 3 FL 000121 Set 3 FL 0010 22 Set 3 FL 0011 23 Set 3 FL 0100 24 Set 3 FL 0101 25Set 3 FL 0110 26 MPM TR 11 27 Set 3 FL 0111 28 Set 3 FL 1000 29 Set 3 FL1001 30 Set 3 FL 1010 31 Set 3 FL 1011 32 Set 3 FL 1100 33 Set 3 FL 110134 Set 3 FL 1111

As illustrated in Table 8A, Set 1 includes 4 intra prediction modes andhas a truncated unary (TU) binarization, Set 2 includes 13 intraprediction modes and has a truncated unary binarization, and Set 3includes 15 intra prediction modes and has a 4-bit fixed lengthbinarization, and each codeword indicates a particular intra predictionmode index. It should be noted that in some examples, a differentmapping of intra prediction modes indices to codewords may be provided.For example, intra estimation unit 302 may be configured to map intraprediction modes indices to codewords based on one or more codingparameters (e.g., a PU type, etc.). Table 8B provides an example of analternative mapping intra prediction modes indices to codewords providedin Table 8A.

TABLE 8B ITU-T H.265 Binarization Codeword  0 MPM TR 0  1 MPM TR 10 10Set 1 TU 0 11 Set 1 TU 01 12 Set 1 TU 001 13 Set 1 TU 000 23 Set 2 TU 024 Set 2 TU 01 25 Set 2 TU 001 27 Set 2 TU 0001 28 Set 2 TU 00001 29 Set2 TU 000001 30 Set 2 TU 0000001 31 Set 2 TU 00000001 32 Set 2 TU000000001 33 Set 2 TU 0000000001 34 Set 2 TU 00000000001  2 Set 2 TU000000000001  3 Set 2 TU 000000000000  4 Set 3 FL 0000  5 Set 3 FL 0001 6 Set 3 FL 0010  7 Set 3 FL 0011  8 Set 3 FL 0100  9 Set 3 FL 0101 14Set 3 FL 0110 26 MPM TR 11 15 Set 3 FL 0111 16 Set 3 FL 1000 17 Set 3 FL1001 18 Set 3 FL 1010 19 Set 3 FL 1011 20 Set 3 FL 1100 21 Set 3 FL 110122 Set 3 FL 1111

It should be noted that although the example described with respect toTables 7-8B includes the 35 intra prediction modes defined in ITU-TH.265, in other examples any number of sets of non-MPM modes may bedefined for any number of possible prediction modes. For example, incase where there are 67 possible intra prediction modes and 6 MPMs(e.g., as described above with respect to JEM), the 61 non-MPM modes maybe grouped into two or more sets and each set may be associated with aparticular binarization. Further, deriving one or more sets ofprediction modes for non-MPM prediction modes may enable a large (e.g.,over 100) number of possible intra prediction modes to be signaledefficiently. Further, in one example, deriving one or more sets ofprediction modes for non-MPM prediction modes may include determining aset of selected modes and a set of non-selected modes, where intraprediction modes are included in the set of selected modes according toa particular function. For example, in the case where there are 61non-MPM modes, in one example of a set of selected modes andnon-selected modes may be defined as follows:

Selected modes={0, 4, 8, 12, 16, . . . 60}

Non-Selected modes={1, 2, 3, 5, 6, 7, 9, 10, . . . 59}

That is, in this example, a set of selected modes is defined by afunction: for N=0 to 15, selected modes equal 4*N. In other examples,any number of sets may be defined according to a function.

Mode encoding unit 306 may be configured to receive a selected intraprediction mode and generate syntax elements having values that enable avideo decoder to generate a reference video block. That is, for example,when one or more sets of non-MPM modes have been derived and codewordshave been mapped to intra prediction modes indices, mode encoding unit306 may provide values for one or more syntax elements that enables adecoder to determine the selected intra prediction mode. Table 9Aprovides an example of syntax that mode encoding unit 306 may use togenerate values for syntax elements to indicate to a selected. Theexample syntax illustrated in Table 9A corresponds to the example setsprovided in the examples of Table 7-8B.

TABLE 9A ... mpm_idx_flag if(mpm_idx_flag == TRUE)  mpm_idx else { set3_idx_flag  if (set3_idx_flag == TRUE)  set3_idx  else {  set1_idx_flag   if (set1_idx_flag == TRUE)   set1_idx   else {   set2_idx     }   }  } ...

As illustrated in Table 9A, ‘mpm_idx_flag’, ‘set3_idx_flag’, and‘set1_idx_flag’ indicate whether the selected intra prediction modebelongs to one of: an MPM candidate list, Set 1, Set 2, or Set 3, adecoder upon determining whether the selected intra mode belongs to anMPM candidate list, Set 1, Set 2, or Set 3 may determine the intraprediction mode based on the corresponding index value (i.e., ‘mpm_idx’,‘set1_idx’, ‘set2_idx’, or ‘set3_idx’). FIG. 4 is a flowchartillustrating encoding intra prediction data according to one or moretechniques of this disclosure. FIG. 4 provides an example of encodingintra prediction data according to the example syntax illustrated inTable 9A. It should be noted that although actions illustrated in FIG. 4are described as being performed by mode encoding unit 306, actionsillustrated in FIG. 4 may be performed by any combination of thecomponents of intra prediction processing unit 300, and may be performedby video encoder 200.

As illustrated in FIG. 4 , mode encoding unit 306 receives a selectedintra prediction mode (402). A selected intra prediction mode mayinclude an intra prediction mode included in a set of possible intraprediction modes including, for example, the sets of possible intraprediction modes described above. Mode encoding unit 306 determineswhether the selected mode is a mode corresponding to an MPM candidate(404). MPM candidates may be derived according to the techniquesdescribed above. Upon determining that the selected mode is a modecorresponding to an MPM candidate, mode encoding unit 306 encodes avalue of true for a corresponding index flag (e.g., ‘mpm_idx_flag’ equalto 1) (406) and further encodes a value indicating an MPM candidatecorresponding to the selected mode (e.g., encodes ‘mpm_idx’ according tothe techniques described above) (408). Upon determining that theselected mode is not a mode corresponding to an MPM candidate, modeencoding unit 306 encodes a value of false for a corresponding indexflag (e.g., ‘mpm_idx_flag’ equal to 0) (410) and determines whether theselected mode is a mode corresponding to a particular derived set ofnon-MPM modes (i.e., Set 3 in FIG. 4 ) (412).

Upon determining that the selected mode is a mode corresponding to theparticular derived set of non-MPM modes, mode encoding unit 306 encodesa value of true for an index flag corresponding to the particular set(e.g., ‘set3_idx_flag’ equal to 1) (414) and further encodes a valueindicating an index for the set corresponding to the selected mode(e.g., encodes ‘set3_idx’ according to the techniques described above)(416). Upon determining that the selected mode is not a modecorresponding to the particular derived set of non-MPM modes, modeencoding unit 306 encodes a value of false for an index flagcorresponding to the particular set (e.g., ‘set3_idx_flag’ equal to 0)(418) and further determines whether the selected mode is a modecorresponding to another particular derived set of non-MPM modes (i.e.,Set 1 in FIG. 4 ) (420). Upon determining that the selected mode is amode corresponding to the particular derived set of non-MPM modes, modeencoding unit 306 encodes a value of true for an index flagcorresponding to the particular set (e.g., ‘set1_idx_flag’ equal to 1)(422) and further encodes a value indicating an index for the setcorresponding to the selected mode (e.g., encodes ‘set1_idx’ accordingto the techniques described above) (424). Upon determining that theselected mode is not a mode corresponding to the particular derived setof non-MPM modes, mode encoding unit 306 encodes a value of false for anindex flag corresponding to the particular set (e.g., ‘set1_idx_flag’equal to 1) (426) and further encodes a value indicating an index for adefault set corresponding to the selected mode (e.g., encodes ‘set2_idx’according to the techniques described above). In this manner, modeencoding unit 306 represents an example of a device configured to encodeintra prediction data. It should be noted that with respect to FIG. 4 ,according to the example binarizations of set 1, set 2, and set 3provided above with respect to Table 7, in several instances one of the32 a non-MPM mode may be indicated using fewer than five bits.

As described above, in some examples sets of selected modes andnon-selected modes may be defined by a function. In one example flagsmay be used to signal functions that are used to define select andnon-selected modes. In one example, 61 non-MPM modes may be included ina first set of modes and a second set modes according to the followingfunctions, where the first set of modes and the second set modes may bedefined according to an indicated function. For example, according to afirst function the first set of modes and the second set modes may bedefined as follows:

Mode_idx_mapped_1={0, 4, 8, 12, 16, . . . 60}

Mode_idx_mapped_2={1, 2, 3, . . . 15}

That is, Mode_idx_mapped_1=Mode_idx_mapped_2*4. Further, according to asecond function the first set of modes and the second set modes may bedefined as follows:

Mode_idx_mapped_1={1, 2, 3, 5, 6, 7, 9, . . . 59}

Mode_idx_mapped_3={0, 1, 2, 3, . . . 44}

That is, Mode_idx_mapped_1=Mode_idx_mapped_3+(Mode_idx_mapped_3/3)+1.

As described above, mode encoding unit 306 may be configured to receivea selected intra prediction mode and generate syntax elements havingvalues that enable a video decoder to generate a reference video block.In the example where a first and a second function are used to definesets, mode encoding unit 306 may provide values for one or more syntaxelements that enables a decoder to determine the sets and determine aparticular mode within a set. Table 9B provides an example of syntaxthat encoding unit 306 may use to generate values for syntax elements toindicate a selected mode. The example syntax illustrated in Table 9Bcorresponds to the example sets Mode_idx_mapped_1, Mode_idx_mapped_2,and Mode_idx_mapped_3. In Table 9B, ‘intra_selected_idx_flag’ indicateswhether Mode_idx_mapped_1=Mode_idx_mapped_2*4 orMode_idx_mapped_1=Mode_idx_mapped_3+(Mode_idx_mapped_3/3)+1.‘mode_map_idx’ indicates mode index for one of Mode_idx_mapped_2 orMode_idx_mapped_3, depending on the value of ‘intra_selected_idx_flag’.From ‘mode_map_idx’, a mode index for Mode_idx_mapped_1 may be derived.‘set_idx’, indicates whether a selected mode corresponding to‘mode_map_idx’, corresponds to Mode_idx_mapped_1 or Mode_idx_mapped_2(e.g., ‘intra_selected_idx_flag’ is TRUE) or Mode_idx_mapped_1 orMode_idx_mapped_3 (e.g., ‘intra_selected_idx_flag’ is FALSE).

TABLE 9B ... mpm_idx_flag if(mpm_idx_flag == TRUE)  mpm_idx else { intra_selected_idx_flag  mode_map_idx  set idx   } ...

In this manner mode encoding unit 306 may be configured to receive aselected intra prediction mode, determine whether the selected intraprediction mode includes most probable mode candidate, and upondetermining the selected intra prediction mode does not include a mostprobable mode candidate, determine whether the selected mode belongs toone of two or more sets, wherein the two or more sets include modesother than the most probable mode candidates.

As described above, in addition to generating reference samplesaccording to a prediction mode, intra prediction coding may includemodifying reference samples prior to generating a residual data usingone or more filtering techniques. Filtering unit 308 may be configuredto receive a prediction mode and reference samples of an intraprediction block and generate a predictive video block. Filtering unit308 may be configured to perform one or more of the boundary smoothingand/or inner pixel filter techniques described above. Further, filteringunit 308 may be configured to filter reference samples of an intraprediction block according to Equation (16).predSamples[x][y]=(f1*p[0][y]+f2*p[x][0]+f3*p[x][y]+offset1)>>offset2  (16)

In one example, in Equation (16), f1=1, f2=1, f3=6, offset1=4, andoffset2=3. In other examples, other values may be used for f1, f2, f3,offset1, offset2. In some examples, the values of f1, f2, f3, offset1,and offset2 in Equation (16) may be dependent on a selected intraprediction mode. Further, in some examples, the values of f1, f2, f3,offset1, and offset2 in Equation (16) may be dependent on the locationof corresponding pixel ((x and y in Equation (16)). Referring to theinter prediction block illustrated in FIG. 12 , using Equation (16) forpredSamples[3][3]: p[0][3] equals 120, p[3][0] equals 132, and p[3][3]equals 132. In the case where f1=1, f2=1, f3=6, offset1=4, offset2=3predSamples[3][3] equals 131. It should be noted that in some examples,in Equation (16), p[0][y] and p[x][0] may be replaced with an averagesample value or most frequently occurring sample value for therespective upper row and left most column of the intra prediction block.In this manner, filtering unit 308 represents an example of a deviceconfigured to receive reference video block generated using an intraprediction, and modify each sample value in the reference video blockbased on a sample value corresponding to an upper row, a sample valuecorresponding to a left column, and a multiplier of a current samplevalue.

As described above, smoothing filters may be applied based on the intraprediction mode used to generate an intra prediction block and/or thesize of the prediction block. Table 10 represents an example of howfiltering unit 308 may apply smoothing filters based on the intraprediction mode used to generate an intra prediction block. It should benoted that although the example in Table 10 is illustrated with respectto the set of 67 possible prediction modes described above with respectto JEM, the techniques described herein may be generally applicableregardless of the number or density of possible intra prediction modes.FIG. 5 illustrates an example where for each of Diagonal (−H, V),Vertical, Diagonal (H,V), Horizontal, and Diagonal (H, −V) and zero ormore neighboring prediction modes, Filter A, Filter B, Filter C, FilterD, or Filter E are respectively applied. It should be noted that in theexample illustrated in FIG. 5 , a Filter may refer to a combination ofone or more filters. For example, a boundary smoothing filter and/or aninner pixel smoothing filter. Further, it should be noted that in theexample illustrated in FIG. 5 , the application of a filter may bedependent on the size of a predictive block. For example, Filter A maybe applied for prediction blocks having a size of at least 16×16 samplesand filter B may be applied for prediction blocks having a sizeincluding at least 32×32 samples. Further, it should be noted that insome examples the application of a particular filter may be used todefine a set of non-MPM prediction modes described above. For example,Set 1, Set 2, and Set 3 may correspond to respective modes where FilterA, Filter C, and Filter E are applied.

Referring to the example illustrated in Table 10, in this example, inaddition to the filters applied to prediction blocks as provide abovewith respect to Table 4, the filter described above with respect toequation (16) is applied when an intra prediction block is generatedusing a planar prediction and boundary smoothing filters, as describedabove, are applied when an intra prediction block is generated using tothe DIA_IDX or neighboring directional prediction modes. It should benoted that in one example, the filtering in Table 10 for the planarprediction mode and the DIA_IDX and neighboring directional predictionmodes may be conditional on the size of a prediction block being greaterthan 16×16 samples (or greater than or equal to 32×32 sample in someexamples).

TABLE 10 JEM Common Mode Index Mode Name (Smoothing Filter) PLANAR  0(Equation (16)) DC_IDX  1 (Equations (3)-(4)) HDIA_IDX  2 (Equations(5)-(8)) HDIA_IDX ~3-10 Neighbors (Equation (13)) . . . . . . HOR_IDX 18(Equations (5)-(8)) . . . . . . DIA_IDX 34 (Equations (5)-(8))(Equations (9)-(12)) DIA_IDX ~35-38  Neighbors (Equations (5)-(8))(Equations (9)-(12)) . . . . . . VER_IDX 50 (Equations (9)-(12)) . . . .. . VDIA_IDX ~58-65  Neighbors (Equation (14)) VDIA_IDX 66 (Equation(9)-(12))

Referring again to FIG. 2 , inter prediction processing unit 214 may beconfigured to perform inter prediction coding for a current video block.Inter prediction processing unit 214 may be configured to receive sourcevideo blocks and calculate a motion vector for PUs of a video block. Amotion vector may indicate the displacement of a PU of a video blockwithin a current video frame relative to a predictive block within areference frame. Inter prediction coding may use one or more referencepictures. Further, motion prediction may be uni-predictive (use onemotion vector) or bi-predictive (use two motion vectors). Interprediction processing unit 214 may be configured to select a predictiveblock by calculating a pixel difference determined by, for example, sumof absolute difference (SAD), sum of square difference (SSD), or otherdifference metrics. As described above, a motion vector may bedetermined and specified according to motion vector prediction. Interprediction processing unit 214 may be configured to perform motionvector prediction, as described above. Inter prediction processing unit214 may be configured to generate a predictive block using the motionprediction data. For example, inter prediction processing unit 214 maylocate a predictive video block within a frame buffer (not shown in FIG.2 ). It should be noted that inter prediction processing unit 214 mayfurther be configured to apply one or more interpolation filters to areconstructed residual block to calculate sub-integer pixel values foruse in motion estimation. Inter prediction processing unit 214 mayoutput motion prediction data for a calculated motion vector to entropyencoding unit 218. As illustrated in FIG. 2 , inter predictionprocessing unit 214 may receive reconstructed video block via postfilter unit 216. Post filter unit 216 may be configured to performdeblocking and/or Sample Adaptive Offset (SAO) filtering. Deblockingrefers to the process of smoothing the boundaries of reconstructed videoblocks (e.g., make boundaries less perceptible to a viewer). SAOfiltering is a non-linear amplitude mapping that may be used to improvereconstruction by adding an offset to reconstructed video data.

Referring again to FIG. 2 , entropy encoding unit 218 receives quantizedtransform coefficients and predictive syntax data (i.e., intraprediction data and motion prediction data). It should be noted that insome examples, coefficient quantization unit 206 may perform a scan of amatrix including quantized transform coefficients before thecoefficients are output to entropy encoding unit 218. In other examples,entropy encoding unit 218 may perform a scan. Entropy encoding unit 218may be configured to perform entropy encoding according to one or moreof the techniques described herein. Entropy encoding unit 218 may beconfigured to output a compliant bitstream, i.e., a bitstream that avideo decoder can receive and reproduce video data therefrom.

FIG. 6 is a block diagram illustrating an example of an entropy encoderthat may be configured to encode syntax elements according to one ormore techniques of this disclosure. Entropy encoding unit 600 mayinclude a context adaptive entropy encoding unit, e.g., a CABAC encoder.As illustrated in FIG. 6 , entropy encoding unit 600 includesbinarization unit 602, an arithmetic encoding unit 604, including abypass encoding engine 606 and a regular encoding engine 608, andcontext modeling unit 610. Entropy encoding unit 600 may receive one ormore syntax elements, such as syntax elements ‘mpm_idx_flag’,‘set3_idx_flag’, ‘set1_idx_flag’, ‘mpm_idx, set1_idx’, ‘set2_idx’,‘set3_idx’, ‘NSST_idx’, and ‘PDPC_idx’ described above.

Binarization unit 602 may be configured to receive a syntax element andproduce a bin string (i.e., binary string). Binarization unit 602 mayuse, for example, any one or combination of the binarization techniquesdescribed above. Further, in some cases, binarization unit 602 mayreceive a syntax element as a binary string and simply passthrough thebin values. In one example, binarization unit 602 receives syntaxelement ‘NSST_idx’ and produces bin values according to the followingtruncated unary binarization provided in Table 11.

TABLE 11 NSST_idx Value Codeword 10 0 11 01 12 001 13 000

In one example, the binarization provided in Table 11 may be used forall intra prediction modes. That is, for prediction modes associatedwith a transform set including two transform matrices and for predictionmodes associated with a transform set including three transformmatrices, the binarization illustrated in Table 11 may be used.

Referring again to FIG. 6 , arithmetic encoding unit 604 is configuredto receive a bin string from binarization unit 602 and performarithmetic encoding on the bin string. As illustrated in FIG. 6 ,arithmetic encoding unit 604 may receive bin values from a bypass pathor the regular coding path. In the case where arithmetic encoding unit604 receives bin values from a bypass path, bypass encoding engine 606may perform arithmetic encoding on bin values without utilizing anadaptive context assigned to a bin value. In one example, bypassencoding engine 606 may assume equal probabilities for possible valuesof a bin.

In the case where arithmetic encoding unit 604 receives bin valuesthrough the regular path, context modeling unit 610 may provide acontext model, such that regular encoding engine 608 may performarithmetic encoding using an identified context model. The contextmodels may be defined according to a video coding standard. The contextmodels may be stored in a memory. Context modeling unit 610 may includea series of indexed tables and/or utilize mapping functions to determinea context model for a particular bin. After encoding a bin value,regular encoding engine 608 may update a context model based on theactual bin values.

In one example, context modeling unit 610 may provide a context modelfor an index flag corresponding to the particular set (e.g.,‘set3_idx_flag’, and ‘set1_idx_flag’) based on the partition size.Further, as described above, in one example, ‘NSST_idx’ may have acommon binarization for prediction modes associated with a transform setincluding two transform matrices and for prediction modes associatedwith a transform set including three transform matrices, as illustratedin Table 11 above. In this case, in one example, context modeling unit610 may be configured to provide a context model for each bin on‘NSST_idx’. Further, in one example, different context models may beused based on whether an intra prediction mode is DC or Planar and/orbased on whether the partition size is equal to 2N×2N. Further, in oneexample, context modeling unit 610 may be configured to provide contextmodels for ‘PDPC_idx’ based on an intra prediction mode and/or apartition size. For example, in one example, if the intra predictionmode is planar or DC, a first context model may be provided, otherwise asecond context model may be provided (e.g., a context modelcorresponding to directional modes). It should be noted that in the casewhere ‘PDPC_idx’ based on an intra prediction mode and/or partition sizethe coding order (e.g., placement within a bitstream) may be as follows:code Partition_size, code Prediction_mode, and code PDPC_idx.

FIG. 7 is a block diagram illustrating an example of a video decoderthat may be configured to decode video data according to one or moretechniques of this disclosure. In one example, video decoder 700 may beconfigured to decode intra prediction data. Video decoder 700 may beconfigured to perform intra prediction decoding and inter predictiondecoding and, as such, may be referred to as a hybrid decoder. In theexample illustrated in FIG. 7 video decoder 700 includes an entropydecoding unit 702, inverse quantization unit 704, inverse transformationprocessing unit 706, intra prediction processing unit 708, interprediction processing unit 710, summer 712, post filter unit 714, andreference buffer 716. Video decoder 700 may be configured to decodevideo data in a manner consistent with a video coding standard. Itshould be noted that although example video decoder 700 is illustratedas having distinct functional blocks, such an illustration is fordescriptive purposes and does not limit video decoder 700 and/orsub-components thereof to a particular hardware or softwarearchitecture. Functions of video decoder 700 may be realized using anycombination of hardware, firmware, and/or software implementations.

As illustrated in FIG. 7 , entropy decoding unit 702 receives an entropyencoded bitstream. Entropy decoding unit 702 may be configured to decodequantized syntax elements and quantized coefficients from the bitstreamaccording to a process reciprocal to an entropy encoding process.Entropy decoding unit 702 may be configured to perform entropy decodingaccording any of the entropy coding techniques described above. Entropydecoding unit 702 may parse an encoded bitstream in a manner consistentwith a video coding standard. In one example, entropy decoding unit 702may be configured to parse one or more of syntax elements,‘mpm_idx_flag’, ‘set3_idx_flag’, ‘set1_idx_flag’, ‘mpm_idx’, ‘set1_idx’,‘set2_idx’, ‘set3_idx’, ‘NSST_idx’, and ‘PDPC_idx’.

FIG. 8 is a block diagram illustrating an example entropy decoding unitthat may implement one or more of the techniques described in thisdisclosure. Entropy decoding unit 800 receives an entropy encodedbitstream and decodes syntax elements from the bitstream. As illustratedin FIG. 8 , entropy decoding unit 800 includes an arithmetic decodingunit 802, which may include a bypass decoding engine 804 and a regulardecoding engine 806. Entropy decoding unit 800 also includes contextmodeling unit 808 and inverse binarization unit 810. Entropy decodingunit 800 may perform reciprocal functions to entropy encoding unit 600described above with respect to FIG. 6 . In this manner, entropydecoding unit 800 may perform entropy decoding based on the entropycoding techniques described herein.

Arithmetic decoding unit 802 receives an entropy encoded bitstream. Asshown in FIG. 8 , arithmetic decoding unit 802 may process encoded binvalues according to a bypass path or the regular coding path. Anindication whether an encoded bin value should be processed according toa bypass path or a regular pass may be signaled in the bitstream withhigher level syntax. Consistent with the CABAC coding process describedabove, in the case where arithmetic decoding unit 802 receives binvalues from a bypass path, bypass decoding engine 804 may performarithmetic decoding on bin values without utilizing a context assignedto a bin value. In one example, bypass decoding engine 804 may assumeequal probabilities for possible values of a bin.

In the case where arithmetic decoding unit 802 receives bin valuesthrough the regular path, context modeling unit 808 may provide acontext model, such that regular decoding engine 806 may performarithmetic decoding based on the context models provided by contextmodeling unit 808. Context modeling unit 808 may include a memory devicestoring a series of indexed tables and/or utilize mapping functions todetermine a context and a context variable. After decoding a bin value,regular decoding engine 806, may update a context model based on thedecoded bin values. In one example, entropy decoding unit 800 may selecta context model and/or bypass decode ‘mpm_idx_flag’, ‘set3_idx_flag’,‘set1_idx_flag’, ‘mpm_idx’, ‘set1_idx’, ‘set2_idx’, ‘set3_idx’,‘NSST_idx’, and/or ‘PDPC_idx’ according to one or more of the techniquesdescribed above.

Inverse binarization unit 810 may perform an inverse binarization on abin value and output syntax element values. In one example, inversebinarization unit 810 may be configured to perform an inversebinarization on syntax elements according to the respective binarizationprocesses described above. In one example, inverse binarization unit 810may be configured to perform an inverse binarization on syntax elements‘mpm_idx_flag’, ‘set3_idx_flag’, ‘set1_idx_flag’, ‘mpm_idx’, ‘set1_idx’,‘set2_idx’, ‘set3_idx’, ‘NSST_idx’, and ‘PDPC_idx’. Further, inversebinarization unit may use a bin matching function to determine if a binvalue is valid. Inverse binarization unit 810 may also update thecontext modeling unit 808 based on the matching determination.

Referring again to FIG. 7 , inverse quantization unit 704 receivesquantized transform coefficients from entropy decoding unit 702. Inversequantization unit 704 may be configured to apply an inversequantization. Inverse transform processing unit 706 may be configured toperform an inverse transformation to generate reconstructed residualdata. The techniques respectively performed by inverse quantization unit704 and inverse transform processing unit 706 may be similar totechniques performed by inverse quantization/transform processing unit208 described above. Inverse transform processing unit 706 may beconfigured to apply an inverse DCT, an inverse DST, an inverse integertransform, NSST, or a conceptually similar inverse transform processesto the transform coefficients in order to produce residual blocks in thepixel domain. Further, as described above, whether particular transform(or type of particular transform) is performed may be dependent on anintra prediction mode. As illustrated in FIG. 7 , reconstructed residualdata may be provided to summer 712. Summer 712 may add reconstructedresidual data to a predictive video block and generate reconstructedvideo data. A predictive video block may be determined according to apredictive video technique (i.e., intra prediction and inter frameprediction).

Intra prediction processing unit 708 may be configured to receive intraprediction syntax elements and retrieve a predictive video block fromreference buffer 716. Reference buffer 716 may include a memory deviceconfigured to store one or more frames of video data. Intra predictionsyntax elements may identify an intra prediction mode, such as the intraprediction modes described above. In one example, intra predictionprocessing unit 708 may receive one or more of syntax elements‘mpm_idx_flag’, ‘set3_idx_flag’, ‘set1_idx_flag’, ‘mpm_idx’, ‘set1_idx’,‘set2_idx’, ‘set3_idx’, ‘NSST_idx’, and ‘PDPC_idx’ described above andreconstruct a video block using according to one or more of the intraprediction coding techniques describe herein.

FIG. 9 is a block diagram illustrating an example of an intra predictionprocessing unit that may be configured to perform intra predictioncoding according to one or more techniques of this disclosure. That is,for example, intra prediction processing unit 900 may be configured todecode intra prediction data. As illustrated in FIG. 9 , intraprediction processing unit 900 includes mode decoding unit 902, intraprediction unit 904, and filtering unit 906. It should be noted thatalthough example intra prediction processing unit 900 is illustrated ashaving distinct functional blocks, such an illustration is fordescriptive purposes and does not limit intra prediction processing unit900 and/or sub-components thereof to a particular hardware or softwarearchitecture. Functions of intra prediction processing unit 900 may berealized using any combination of hardware, firmware, and/or softwareimplementations.

Intra prediction unit 904 may be configured to receive a selected intraprediction mode and generate a reference video block. Intra predictionunit 904 may operate in a manner similar to intra prediction unit 304described above. Filtering unit 906 may be configured to receive aprediction mode and reference samples of an intra prediction block andgenerate a predictive video block. Filtering unit 906 may be configuredto perform one or more of the boundary smoothing and/or inner pixelfilter in techniques described above. Filtering unit 906 may beconfigured to perform filtering, as described above with respect tofiltering unit 308.

FIG. 10 is a flowchart illustrating an example of decoding intraprediction data and generating a filtered reconstructed block of videodata according to one or more techniques of this disclosure. FIG. 10provides an example of encoding intra prediction data according to theexample syntax illustrated in Table 9A. It should be noted that althoughactions illustrated in FIG. 10 are described as being performed by intraprediction processing unit 900, actions illustrated in FIG. 10 may beperformed by any combination of the components of intra predictionprocessing unit 900 and may be performed by video decoder 700.

As illustrated in FIG. 10 , intra prediction processing unit 900 parsesa most probable mode index flag. (1002). Intra prediction processingunit 900 determines whether the selected mode is a mode corresponding toan MPM candidate based on the value of the mode index flag (1004). Upondetermining that the selected mode is a mode corresponding to an MPMcandidate, intra prediction processing unit 900 parses a valueindicating an MPM candidate corresponding to the selected mode (e.g.,parses ‘mpm_idx’ according to the techniques described above) (1006).Upon determining that the selected mode is not a mode corresponding toan MPM candidate, intra prediction processing unit 900 parses an indexflag (1008) and determines whether the selected mode is a modecorresponding to a particular derived set of non-MPM modes (i.e., Set 3in FIG. 10 ) (1010). Upon determining that the selected mode is a modecorresponding to the particular derived set of non-MPM modes, intraprediction processing unit 900 parses a value indicating an index forthe set corresponding to the selected mode (e.g., parses ‘set3_idx’according to the techniques described above) (1012). Upon determiningthat the selected mode is not a mode corresponding to the particularderived set of non-MPM modes, intra prediction processing unit 900parses an index flag (1014) and further determines whether the selectedmode is a mode corresponding to another particular derived set ofnon-MPM modes (i.e., Set 1 in FIG. 10 ) (1016). Upon determining thatthe selected mode is a mode corresponding to the particular derived setof non-MPM modes, intra prediction processing unit 900 parses a valueindicating an index for the set corresponding to the selected mode(e.g., parses ‘set1_idx’ according to the techniques described above)(1018). Upon determining that the selected mode is not a modecorresponding to the particular derived set of non-MPM modes, intraprediction processing unit parses a value indicating an index for adefault set corresponding to the selected mode (e.g., parses ‘set2_idx’according to the techniques described above). As further illustrated, inFIG. 10 , intra prediction processing unit 900 generates a reconstructedpredictive block of video data based on the parse syntax element (1022).Intra prediction processing unit 900 filters the reconstructed block(1024). Examples of filtering techniques that may be applied aredescribed above.

Referring again to FIG. 7 , inter prediction processing unit 710 mayreceive inter prediction syntax elements and generate motion vectors toidentify a prediction block in one or more reference frames stored inreference buffer 716. Inter prediction processing unit 710 may producemotion compensated blocks, possibly performing interpolation based oninterpolation filters. Identifiers for interpolation filters to be usedfor motion estimation with sub-pixel precision may be included in thesyntax elements. Inter prediction processing unit 710 may useinterpolation filters to calculate interpolated values for sub-integerpixels of a reference block. Post filter unit 714 may be configured toperform filtering on reconstructed video data. For example, post filterunit 714 may be configured to perform deblocking and/or SAO filtering,as described above with respect to post filter unit 216. Further, itshould be noted that in some examples, post filter unit 714 may beconfigured to perform proprietary discretionary filter (e.g., visualenhancements). As illustrated in FIG. 7 , a reconstructed video blockmay be output by video decoder 700. In this manner, video decoder 700may be configured to generate reconstructed video data according to oneor more of the techniques described herein. In this manner video decoder700 may be configured to determine whether a selected intra predictionmode includes a most probable mode candidate, upon determining theselected intra prediction mode does not include a most probable modecandidate, determine which of two or more sets the selected modebelongs, wherein the two or more sets include modes other than the mostprobable mode candidates, and parse an index value associated with theset the selected mode belongs, and determining a mode based on the indexvalue.

In one or more examples, the functions described may be implemented inhardware, software, firmware, or any combination thereof. If implementedin software, the functions may be stored on or transmitted over as oneor more instructions or code on a computer-readable medium and executedby a hardware-based processing unit. Computer-readable media may includecomputer-readable storage media, which corresponds to a tangible mediumsuch as data storage media, or communication media including any mediumthat facilitates transfer of a computer program from one place toanother, e.g., according to a communication protocol. In this manner,computer-readable media generally may correspond to (1) tangiblecomputer-readable storage media which is non-transitory or (2) acommunication medium such as a signal or carrier wave. Data storagemedia may be any available media that can be accessed by one or morecomputers or one or more processors to retrieve instructions, codeand/or data structures for implementation of the techniques described inthis disclosure. A computer program product may include acomputer-readable medium.

By way of example, and not limitation, such computer-readable storagemedia can comprise RAM, ROM, EEPROM, CD-ROM or other optical diskstorage, magnetic disk storage, or other magnetic storage devices, flashmemory, or any other medium that can be used to store desired programcode in the form of instructions or data structures and that can beaccessed by a computer. Also, any connection is properly termed acomputer-readable medium. For example, if instructions are transmittedfrom a website, server, or other remote source using a coaxial cable,fiber optic cable, twisted pair, digital subscriber line (DSL), orwireless technologies such as infrared, radio, and microwave, then thecoaxial cable, fiber optic cable, twisted pair, DSL, or wirelesstechnologies such as infrared, radio, and microwave are included in thedefinition of medium. It should be understood, however, thatcomputer-readable storage media and data storage media do not includeconnections, carrier waves, signals, or other transitory media, but areinstead directed to non-transitory, tangible storage media. Disk anddisc, as used herein, includes compact disc (CD), laser disc, opticaldisc, digital versatile disc (DVD), floppy disk and Blu-ray disc wheredisks usually reproduce data magnetically, while discs reproduce dataoptically with lasers. Combinations of the above should also be includedwithin the scope of computer-readable media.

Instructions may be executed by one or more processors, such as one ormore digital signal processors (DSPs), general purpose microprocessors,application specific integrated circuits (ASICs), field programmablelogic arrays (FPGAs), or other equivalent integrated or discrete logiccircuitry. Accordingly, the term “processor,” as used herein may referto any of the foregoing structure or any other structure suitable forimplementation of the techniques described herein. In addition, in someaspects, the functionality described herein may be provided withindedicated hardware and/or software modules configured for encoding anddecoding, or incorporated in a combined codec. Also, the techniquescould be fully implemented in one or more circuits or logic elements.

The techniques of this disclosure may be implemented in a wide varietyof devices or apparatuses, including a wireless handset, an integratedcircuit (IC) or a set of ICs (e.g., a chip set). Various components,modules, or units are described in this disclosure to emphasizefunctional aspects of devices configured to perform the disclosedtechniques, but do not necessarily require realization by differenthardware units. Rather, as described above, various units may becombined in a codec hardware unit or provided by a collection ofinteroperative hardware units, including one or more processors asdescribed above, in conjunction with suitable software and/or firmware.

Moreover, each functional block or various features of the base stationdevice and the terminal device used in each of the aforementionedembodiments may be implemented or executed by a circuitry, which istypically an integrated circuit or a plurality of integrated circuits.The circuitry designed to execute the functions described in the presentspecification may comprise a general-purpose processor, a digital signalprocessor (DSP), an application specific or general applicationintegrated circuit (ASIC), a field programmable gate array (FPGA), orother programmable logic devices, discrete gates or transistor logic, ora discrete hardware component, or a combination thereof. Thegeneral-purpose processor may be a microprocessor, or alternatively, theprocessor may be a conventional processor, a controller, amicrocontroller or a state machine. The general-purpose processor oreach circuit described above may be configured by a digital circuit ormay be configured by an analogue circuit. Further, when a technology ofmaking into an integrated circuit superseding integrated circuits at thepresent time appears due to advancement of a semiconductor technology,the integrated circuit by this technology is also able to be used.

Various examples have been described. These and other examples arewithin the scope of the following claims.

<Overview>

In one example, a method of encoding intra prediction data, comprisesreceiving a selected intra prediction mode, determining whether theselected intra prediction mode includes a most probable mode candidate,upon determining the selected intra prediction mode does not include amost probable mode candidate, determining whether the selected intraprediction mode belongs to one of two or more sets, wherein the two ormore sets include modes other than the most probable mode candidates.

In one example, a device for video encoding comprises one or moreprocessors configured to receive a selected intra prediction mode,determine whether the selected intra prediction mode includes mostprobable mode candidate, upon determining the selected intra predictionmode does not include a most probable mode candidate, determine whetherthe selected belongs to one of two or more sets, wherein the two or moresets include modes other than the most probable mode candidates.

In one example, a non-transitory computer-readable storage mediumcomprises instructions stored thereon that, when executed, cause one ormore processors of a device for encoding video data to receive aselected intra prediction mode, determine whether the selected intraprediction mode includes a most probable mode candidate, upondetermining the selected intra prediction mode does not include a mostprobable mode candidate, determine whether the selected belongs to oneof two or more sets, wherein the two or more sets include modes otherthan the most probable mode candidates.

In one example, an apparatus for encoding video data comprises means forreceiving a selected intra prediction mode, means for determiningwhether the selected intra prediction mode includes a most probable modecandidate, means for determining whether the selected intra predictionmode belongs to one of two or more sets, upon determining the selectedintra prediction mode does not include a most probable mode candidate,wherein the two or more sets include modes other than the most probablemode candidates.

In one example, a method of decoding a syntax element associated withvideo data comprises determining whether a selected intra predictionmode includes a most probable mode candidate, upon determining theselected intra prediction mode does not include a most probable modecandidate, determining which of two or more sets the selected modebelongs, wherein the two or more sets include modes other than the mostprobable mode candidates, and parsing an index value associated with theset the selected mode belongs, and determining a mode based on the indexvalue.

In one example, a device for decoding video data comprises one or moreprocessors configured to determine whether a selected intra predictionmode includes a most probable mode candidate, upon determining theselected intra prediction mode does not include a most probable modecandidate, determine which of two or more sets the selected modebelongs, wherein the two or more sets include modes other than the mostprobable mode candidates, parse an index value associated with the setthe selected mode belongs, and determine a mode based on the indexvalue.

In one example, a non-transitory computer-readable storage mediumcomprises instructions stored thereon that, when executed, cause one ormore processors of a device for decoding video data to determine whethera selected intra prediction mode includes a most probable modecandidate, upon determining the selected intra prediction mode does notinclude a most probable mode candidate, determine which of two or moresets the selected mode belongs, wherein the two or more sets includemodes other than the most probable mode candidates, parse an index valueassociated with the set the selected mode belongs, and determine a modebased on the index value.

In one example, an apparatus for decoding video data comprises means fordetermining whether a selected intra prediction mode includes a mostprobable mode candidate, means for determining which of two or more setsthe selected mode belongs, upon determining the selected intraprediction mode does not include a most probable mode candidate, whereinthe two or more sets include modes other than the most probable modecandidates, and means for determining which of two or more sets theselected mode belongs, means for parsing an index value associated withthe set the selected mode belongs, and means for determining a modebased on the index value.

CROSS REFERENCE

The present application is a continuation application of U.S. patentapplication Ser. No. 16/076,271, filed on Aug. 7, 2018, which is theNational Stage of International Application No. PCT/JP2017/003234, filedJan. 30, 2017, which claims priority under 35 U.S.C. § 119 onprovisional Application No. 62/292,801 on Feb. 8, 2016, and provisionalApplication No. 62/296,848 on Feb. 18, 2016, the entire contents ofwhich are hereby incorporated by reference.

The invention claimed is:
 1. A method of decoding intra prediction data,the method comprising: determining an intra prediction mode generatingprediction samples using the intra prediction mode, wherein generatingthe prediction samples includes filtering reference samples based on theintra prediction mode which is a planar prediction mode or an above-leftdiagonal prediction mode, wherein the reference samples are filteredwhen a size of a prediction block is greater than a predetermined value;and parsing an index value indicating a transform matrix of a transformset for a non-separable transform, wherein the transform matrix isderived based on the intra prediction mode, and wherein the index valuehas a truncated unary binarization.